Reachability by paths of bounded curvature in a convex polygon
نویسندگان
چکیده
منابع مشابه
Reachability by paths of bounded curvature in a convex polygon
Let B be a point robot moving in the plane, whose path is constrained to forward motions with curvature at most one, and let P be a convex polygon with n vertices. Given a starting configuration (a location and a direction of travel) for B inside P , we characterize the region of all points of P that can be reached by B, and show that it has complexity O(n). We give an O(n) time algorithm to co...
متن کاملCurvature-Constrained Shortest Paths in a Convex Polygon
Let B be a point robot moving in the plane, whose path is constrained to have curvature at most 1, and let P be a convex polygon with n vertices. We study the collision-free, optimal path-planning problem forB moving between two configurations insideP (a configuration specifies both a location and a direction of travel). We present an O(n2 log n) time algorithm for determining whether a collisi...
متن کاملConvex tours of bounded curvature
We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with m vertices, containing an obstacle in a form of a simple polygon with n vertices. We present an O(m + n) time algorithm finding the path, going around the obstacle, whose curvature is the smallest po...
متن کاملConvex Hulls of Bounded Curvature
In this paper, we consider the problem of computing a convex hull of bounded curvature of a set S of points in the plane, i.e. a set containing S and whose boundary is a curve of bounded curvature of minimal length. We prove that, if the radius of the smallest disk that contains S is greater than 1, such a hull is unique. We show that the computation of a convex hull of bounded curvature reduce...
متن کاملBounded-Curvature Shortest Paths through a Sequence of Points Using Convex Optimization
We consider the problem of computing shortest paths having curvature at most one almost everywhere and visiting a sequence of n points in the plane in a given order. This problem is a sub-problem of the Dubins Traveling Salesman Problem and also arises naturally in path planning for point car-like robots in the presence of polygonal obstacles. We show that when consecutive waypoints are distanc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2012
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2011.07.003